Bothway embedding of circulant network into grid
نویسندگان
چکیده
منابع مشابه
Embedding into the rectilinear grid
We show that the embedding of metric spaces into the l1-grid Z can be characterized in essentially the same fashion as in the case of the l1-plane R . In particular, a metric space can be embedded into Z iff every subspace with at most 6 points is embeddable. Moreover, if such an embedding exists, it can be constructed in polynomial time (for finite spaces) . q 1998 John Wiley & Sons, Inc. Netw...
متن کاملEMBEDDING OF CIRCULANT NETWORKS INTO k-ROOTED SIBLING TREES
Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we determine the exact wirelength and dilation of embedding circulant networks into k-rooted sibling trees. AMS Subject Classification: 05C78, 05C85
متن کاملCirculant Binary Embedding
Binary embedding of high-dimensional data requires long codes to preserve the discriminative power of the input space. Traditional binary coding methods often suffer from very high computation and storage costs in such a scenario. To address this problem, we propose Circulant Binary Embedding (CBE) which generates binary codes by projecting the data with a circulant matrix. The circulant struct...
متن کاملEmbedding Circulant Networks into Butterfly and Benes Networks
The dilation of an embedding is defined as the maximum distance between pairs of vertices of host graph that are images of adjacent vertices of guest graph. An embedding with a long dilation faces many problems, such as long communication delay, coupling problems and the existence of different types of uncontrolled noise. In this paper, we compute the minimum dilation of embedding circulant net...
متن کاملEmbedding Graphs into the Extended Grid
Let G = (V;E) be an arbitrary undirected source graph to be embedded in a target graph EM , the extended grid with vertices on integer grid points and edges to nearest and next-nearest neighbours. We present an algorithm showing how to embed G into EM in both time and space O(jV j) using the new notions of islands and bridges. An island is a connected subgraph in the target graph which is mappe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2015
ISSN: 1570-8667
DOI: 10.1016/j.jda.2015.01.001